Bounds for increasing multi-state consecutive k-out-of-r-from-n: F system with equal components probabilities

Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System

In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...

Efficient algorithms for reliability of a consecutive 2-out-of-r-from-n: F system

On Conditional Inactivity Time of Failed Components in an (n-k+1)-out-of-n System with Nonidentical Independent Components

In this paper, we study an (n-k+1)-out-of-n system by adopting their components to be statistically independent though nonidentically distributed. By assuming that at least m components at a fixed time have failed while the system is still working, we obtain the mixture representation of survival function for a quantity called the conditional inactivity time of failed components in the system. ...

New Improved Bounds for Reliability of Consecutive-k-out-of-n :f Systems

New bounds are found for the reliability of consecutive-k-out-of-n:F systems with equal component failure probabilities. The expressions involved are simple, thus allowing a direct use in the derivation of theoretical properties. These bounds can also be employed in numerical computations when the value of n or k is so large that the exact calculation of the reliability is not achievable. Compa...

Real Time Study of a k-out-of-n System: n Identical Elements with Increasing Failure Rates